Group sequencing a PCB assembly system via an expected sequence dependent setup heuristic
نویسندگان
چکیده
In circuit board manufacturing, the production sequencing problem with sequence dependent setups is complicated by the fact that the amount of setup required depends on not only the setup directly before the current setup, but can depend on all of the preceding setups. We present a case study that examines the use of a heuristic for estimating the expected number of setups from the sequence dependent setups. Our method is based on estimating the expected number of setups which may occur given a board-feeder setup configuration. Once estimates for the sequence dependent setups are established, they can be used to measure the similarity between boards in clustering algorithms and in nearest neighbor heuristics for group sequencing. The method is tested on an actual printed circuit board assembly system. Then, using a simulation of the assembly system, we compare the sequences generated using the expected number of setups distance measure and the Hamming distance measure to optimal sequences. Our results indicate that grouped sequences generated by using the expected number of setups had significantly better makespan performance when compared to sequences based on the more traditional Hamming distance for the particular system under study. The significant gains in makespan resulted in only moderate increases in work in process and slight increases in manual station utilization.
منابع مشابه
A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملGenetic Algorithm Application in a Dynamic PCB Assembly with Carryover Sequence- Dependent Setups
We consider a typical problem in the assembly of printed circuit boards (PCBs) in a two-machine flow shop system to simultaneously minimize the weighted sum of weighted tardiness and weighted flow time. The investigated problem is a group scheduling problem in which PCBs are assembled in groups and the interest is to find the best sequence of groups as well as the boards within each group to mi...
متن کاملA bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
متن کامل
Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 45 شماره
صفحات -
تاریخ انتشار 2003